A local search framework for industrial test laboratory scheduling
نویسندگان
چکیده
منابع مشابه
A novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملLocal Search for Grid Scheduling
This work introduces local search based algorithms as a new technique for the Grid scheduling problem. Specific algorithms based on dispatching rules and local search were proposed and implemented to generate schedule for dynamically arriving jobs. Algorithm performance was compared with typical queue-based algorithms on the basis of objective function optimisation and time required to generate...
متن کاملScheduling Abstractions for Local Search
Comet is an object-oriented language supporting a constraintbased architecture for local search. This paper presents a collection of abstractions, inspired by constraint-based schedulers, to simplify scheduling algorithms by local search in Comet. The main innovation is the computational model underlying the abstractions. Its core is a precedence graph which incrementally maintains a candidate ...
متن کاملA new SDN-based framework for wireless local area networks
Nowadays wireless networks are becoming important in personal and public communication andgrowing very rapidly. Similarly, Software Dened Network (SDN) is an emerging approach to over-come challenges of traditional networks. In this paper, a new SDN-based framework is proposedto ne-grained control of 802.11 Wireless LANs. This work describes the benets of programmableAcc...
متن کاملLocal Search for Deadline Driven Grid Scheduling
This work describes application of local search based algorithms for job scheduling in the Grid environment where dynamic changes occur. The primary intent is to consider problems with the typical quality of service constraint taking into account and minimizing the number of late jobs. To achieve this goal a special instance of the Tabu search algorithm applicable to dynamic problems is propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2021
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-021-04007-1